An efficient linearity and bound preserving conservative interpolation (remapping) on polyhedral meshes
نویسندگان
چکیده
An accurate conservative interpolation (remapping) algorithm is an essential component of most Arbitrary Lagrangian–Eulerian (ALE) methods. In this paper, we describe an efficient linearity and bound preserving method for polyhedral meshes. The algorithm is based on reconstruction, approximate integration and conservative redistribution. We validate our method with a suite of numerical examples, analyzing the results from the viewpoint of accuracy and order of convergence. Published by Elsevier Ltd. PACS: 02.70. c; 47.11.+j
منابع مشابه
Boolean operations on arbitrary polyhedral meshes
A floating-point arithmetic algorithm designed for solving usual boolean operations (intersection, union, and difference) on arbitrary polyhedral meshes is described in this paper. It can be used in many preand post-processing applications in computational physics (e.g. cut-cell volume mesh generation or high order conservative remapping). The method provides conformal polyhedral meshes upon ex...
متن کاملExtension of efficient, swept-integration-based conservative remapping method for meshes with changing connectivity
In numerical simulations of fluid flow, the choice of the computational mesh is crucial. Traditionally, there have been two viewpoints, utilizing the Lagrangian or the Eulerian framework, each with its own advantages and disadvantages. In a pioneering paper [1], Hirt et al. developed the formalism for a mesh whose motion could be determined as an independent degree of freedom, and showed that t...
متن کاملInterpolation-based second-order monotone finite volume schemes for anisotropic diffusion equations on general grids
We propose two interpolation-based monotone schemes for the anisotropic diffusion problems on unstructured polygonal meshes through the linearity-preserving approach. The new schemes are characterized by their nonlinear two-point flux approximation, which is different from the existing ones and has no constraint on the associated interpolation algorithm for auxiliary unknowns. Thanks to the new...
متن کاملModeling Polyhedral Meshes with Affine Maps
We offer a framework for editing and modeling of planar meshes, focusing on planar quad, and hexagonaldominant meshes, which are held in high demand in the field of architectural design. Our framework manipulates these meshes by affine maps that are assigned per-face, and which naturally ensure the planarity of these faces throughout the process, resulting in a linear subspace of compatible pla...
متن کاملThe Error-Minimization-Based Strategy for Moving Mesh Methods
The typical elements in a numerical simulation of fluid flow using moving meshes are a time integration scheme, a rezone method in which a new mesh is defined, and a remapping (conservative interpolation) in which a solution is transferred to the new mesh. The objective of the rezone method is to move the computational mesh to improve the robustness, accuracy and eventually efficiency of the si...
متن کامل